Diameter increase caused by edge deletion
نویسندگان
چکیده
منابع مشابه
Diameter vulnerability of graphs by edge deletion
Let f (t, k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-connected graph with diameter k. This paper shows 4 √ 2t−6 < f (t, 3) ≤ max{59, 5 √ 2t+7} for t ≥ 4, which corrects an improper result in [C. Peyrat, Diameter vulnerability of graphs, Discrete Appl. Math. 9 (3) (1984) 245–250] and also determines f (2, k) = 3k − 1 and f (3, k) = 4k − 2 for k ≥ 3. c © 2...
متن کاملEdge Deletion Preserving the Diameter of the Hypercube
We give upper and lower bounds to the number un(Q.) of edges that one can remove from a hypercube without altering its diameter, namely: (n 2) 2”-’ ( ( Ln;2,) ) + 2 < un( Qn) < (n 2)2”_’ + 1 [(2” 1)/(2nl)].
متن کاملOn Bayesian Network Approximation by Edge Deletion
We consider the problem of deleting edges from a Bayesian network for the purpose of simplifying models in probabilistic inference. In particular, we propose a new method for deleting network edges, which is based on the evidence at hand. We provide some interesting bounds on the KL-divergence between original and approximate networks, which highlight the impact of given evidence on the quality...
متن کاملIncrease in streptomycin production caused by tunicamycin.
We reported previously that D-glucosamine or a close derivative was involved in the synthesis of the N-methyl-L-glucosamine moiety of streptomycin'). Since D-glucosamine is a component of the cell wall of streptomycetes2,3), this sugar or its derivatives may be a common precursor of streptomycin and the cell wall. We studied also whether UDP-N-methyl D glucosaminephosphate was involved in the s...
متن کاملA Variational Approach for Approximating Bayesian Networks by Edge Deletion
We consider in this paper the formulation of approximate inference in Bayesian networks as a problem of exact inference on an approximate network that results from deleting edges (to reduce treewidth). We have shown in earlier work that deleting edges calls for introducing auxiliary network parameters to compensate for lost dependencies, and proposed intuitive conditions for determining these p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1987
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.3190110315